Decompositions of Triangle-Dense Graphs∗ Rishi Gupta† Tim Roughgarden‡ C. Seshadhri

Source URL: theory.stanford.edu

• Graph theory
• Neighbourhood
• Clique
• Bipartite graph
• Planar graph
• Graph
• Treewidth
• Dense graph
• Triangle
• Graph operations
• Graph coloring
• Triangle-free graph

CS168: The Modern Algorithmic Toolbox Lecture #5: Sampling and Estimation Tim Roughgarden & Gregory Valiant April 23, 2015 This week, we will cover tools for making inferences based on random samples drawn from some dist

Source URL: web.stanford.edu

Approximation in Algorithmic Game Theory Robust Approximation Bounds for Equilibria and Auctions Tim Roughgarden Stanford University

Source URL: theory.stanford.edu

CS168: The Modern Algorithmic Toolbox Lecture #1: Introduction and Consistent Hashing Tim Roughgarden & Gregory Valiant March 30,

Source URL: web.stanford.edu

Tight Error Bounds for Structured Prediction Amir Globerson Tim Roughgarden David Sontag

Source URL: arxiv.org

Network Cost-Sharing without Anonymity∗ Tim Roughgarden† Okke Schrijvers‡ May 16, 2015

Source URL: theory.stanford.edu

Intrinsic Robustness of the Price of Anarchy∗ Tim Roughgarden† July 3, 2013 Abstract The price of anarchy, defined as the ratio of the worst-case objective function value of a

Source URL: theory.stanford.edu

An Algorithmic Game Theory Primer∗ Tim Roughgarden† June 21, 2008 Abstract We give a brief and biased survey of the past, present, and future of research on the interface

Source URL: theory.stanford.edu

Algorithmic Game Theory Edited by ´ Tardos, and Vijay Vazirani Noam Nisan, Tim Roughgarden, Eva Contents

Source URL: www.cs.huji.ac.il

Privately Solving Linear Programs Justin Hsu∗ Aaron Roth† Tim Roughgarden‡

Source URL: privacytools.seas.harvard.edu

• Linear programming
• Convex optimization
• Differential privacy
• Exponential mechanism
• Laplace distribution
• Duality
• Mathematical optimization
• Operations research
• Data privacy